Termination w.r.t. Q of the given QTRS could be disproven:

0 QTRS
↳1 NonTerminationProof (⇔)
↳2 NO

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(b(a(a(b(x1)))))) → b(b(a(b(a(b(x1))))))
b(a(b(b(x1)))) → b(b(a(a(b(a(b(x1)))))))

Q is empty.

(1) NonTerminationProof (EQUIVALENT transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:
b a b a a b b b a a b b → b b b a a b b a b b a a b a b a a b b b a a b b a b a b a b

b a b a a b b b a a b b → b b b a a b b a b b a a b a b a a b b b a a b b a b a b a b
by OverlapClosure OC 2
b a b a a b b b → b b b a a b b a b b a a b a b a a b a b
by OverlapClosure OC 3
b a b a a b b b → b b b a a b b a b a b b a a b a b
by OverlapClosure OC 2
b a b a a b b → b b b a a b b a b a b a b
by OverlapClosure OC 3
b a b a a b b → b b b a a b a b a a b a b
by OverlapClosure OC 3
b a b a a b b → b b a b b a a b a b
by OverlapClosure OC 2
b a b a a b → b b a b a b
by original rule (OC 1)
b a b b → b b a a b a b
by original rule (OC 1)
b a b b → b b a a b a b
by original rule (OC 1)
b a b a a b → b b a b a b
by original rule (OC 1)
b a b b → b b a a b a b
by original rule (OC 1)
b a b b → b b a a b a b
by original rule (OC 1)
b a b a a b b → b b b a a b b a b a b a b
by OverlapClosure OC 3
b a b a a b b → b b b a a b a b a a b a b
by OverlapClosure OC 3
b a b a a b b → b b a b b a a b a b
by OverlapClosure OC 2
b a b a a b → b b a b a b
by original rule (OC 1)
b a b b → b b a a b a b
by original rule (OC 1)
b a b b → b b a a b a b
by original rule (OC 1)
b a b a a b → b b a b a b
by original rule (OC 1)

(2) NO